Papers with relation representations
Improving Knowledge Graph Embedding Using Simple Constraints (P18-1)
Copied to clipboard
| Challenge: | Recent efforts focused on designing more complicated models or incorporating extra information beyond triples. |
| Approach: | They propose to use non-negativity constraints on entity representations and approximate entailment constraints on relation representations to improve KG embedding. |
| Outcome: | The proposed model outperforms baseline models on WordNet, Freebase, and DBpedia. |
Jointly Learning Entity and Relation Representations for Entity Alignment (D19-1)
Copied to clipboard
| Challenge: | Entity alignment is a viable method for integrating heterogeneous knowledge among different knowledge graphs (KGs). |
| Approach: | They propose a Graph Convolutional Network-based framework for learning relation representations by embedding relation seeds into entities and incorporating relation approximation into entities to iteratively improve alignment. |
| Outcome: | The proposed approach outperforms state-of-the-art methods on three real-world cross-lingual datasets. |
Prompt-based Logical Semantics Enhancement for Implicit Discourse Relation Recognition (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for identifying discourse relations without explicit connectives are limited by the availability of annotated data. |
| Approach: | They propose a method that injects knowledge relevant to discourse relation into pre-trained language models through prompt-based connective prediction. |
| Outcome: | The proposed method achieves outstanding performance against the current state-of-the-art models. |
Structure Regularized Neural Network for Entity Relation Classification for Chinese Literature Text (N18-2)
Copied to clipboard
| Challenge: | Existing methods for relation classification have been used in natural language processing. |
| Approach: | They propose a relation classification task for Chinese literature text using a new dataset. |
| Outcome: | The proposed model outperforms the state-of-the-art methods on Chinese literature text. |
A Simple yet Effective Relation Information Guided Approach for Few-Shot Relation Extraction (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to introduce relation information into the model are limited by labeling and data scarcity. |
| Approach: | They propose a direct addition approach to introduce relation information into a model by concatenating two views of relations and adding them to the original prototype. |
| Outcome: | The proposed approach improves on the benchmark dataset FewRel 1.0 and shows comparable results to the state-of-the-art. |
Adaptive Convolution for Multi-Relational Learning (N19-1)
Copied to clipboard
| Challenge: | Existing convolutional neural networks fail to model full interactions between entities and relations, which limits the performance of link prediction. |
| Approach: | They propose a convolutional network that maximizes entity-relation interactions in a convergent fashion. |
| Outcome: | The proposed convolutional network performs better than baseline models on multiple datasets. |
Cluster-aware Pseudo-Labeling for Supervised Open Relation Extraction (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods to extract novel relations do not achieve effective knowledge transfer . experimental results show that the proposed method is state-of-the-arts . |
| Approach: | They propose a Cluster-aware Pseudo-Labeling method to improve pseudo-labels quality . they firstly pre-trained the relation models with pre-defined relations to learn them . |
| Outcome: | The proposed method improves the pseudo-labels quality and transfer more knowledge for discovering novel relations. |
Edge-Enhanced Graph Convolution Networks for Event Detection with Syntactic Relation (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Event detection (ED) is a key subtask of information extraction. |
| Approach: | They propose an architecture that exploits syntactic structure and typed dependency label information to perform event detection. |
| Outcome: | The proposed architecture exploits syntactic structure and typed dependency label information to perform ED. |
Actively Supervised Clustering for Open Relation Extraction (2023.acl-long)
Copied to clipboard
| Challenge: | Existing methods for Open Relation Extraction (OpenRE) use a two-stage pipeline, which learns relation representations and assignments in the first stage, then manually labels relation for each cluster. |
| Approach: | They propose a method that performs relation learning and relation labeling simultaneously without a significant increase in human effort. |
| Outcome: | The proposed method improves existing SOTA methods by 13.8% and 10.6% on two datasets. |
Global-to-Local Neural Networks for Document-Level Relation Extraction (2020.emnlp-main)
Copied to clipboard
| Challenge: | Relation extraction (RE) aims to identify the semantic relations between named entities in text. |
| Approach: | They propose a novel relation extraction model that encodes document information in terms of entity global and local representations and context relation representations. |
| Outcome: | The proposed model achieves superior performance on two public datasets for document-level RE. |
PairRE: Knowledge Graph Embeddings via Paired Relation Vectors (2021.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods fail to solve two major problems at the same time, leading to unsatisfactory results. |
| Approach: | They propose a model with paired vectors for each relation representation that can be adaptively adjusted to fit for different complex relations. |
| Outcome: | Experiments on two knowledge graph datasets show the proposed model can handle complex relations and encode relation patterns. |
Open Hierarchical Relation Extraction (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing OpenRE methods cast different relation types in isolation without considering their hierarchical dependency. |
| Approach: | They propose a framework to establish bidirectional connections between OpenRE and relation hierarchies by integrating hierarchy information into relation representations. |
| Outcome: | The proposed framework outperforms state-of-the-art models on relation clustering and hierarchy expansion. |
Global and Local Hierarchy-aware Contrastive Framework for Implicit Discourse Relation Recognition (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to integrate whole hierarchical information of senses into discourse relation representations for multi-level sense recognition ignore static hierarchic structure containing all senses and ignore hierarchically sense label sequence corresponding to each instance. |
| Approach: | They propose to use a GlObal and Local Hierarchy-aware Contrastive Framework to model two kinds of hierarchies with the aid of multi-task learning and contrastive learning to learn better representations of discourse relation relationships. |
| Outcome: | The proposed method outperforms current state-of-the-art models at all hierarchical levels on PDTB 2.0 and PDTP 3.0 datasets. |
SRM-LLM: Semantic Relationship Mining with LLMs for Temporal Knowledge Graph Extrapolation (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for temporal knowledge graph extrapolation neglect the complex semantic relationships between relations when modeling their dynamic evolution. |
| Approach: | They propose a method for extracting semantic relationships to achieve TKG extrapolation . they use large language models to analyze the types of relations in TKGs . |
| Outcome: | The proposed method improves on five TKG datasets and shows performance gains. |
Towards Human-Like Machine Comprehension: Few-Shot Relational Learning in Visually-Rich Documents (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing document AI approaches fail to consider key-value relations in visually-rich documents . a few-shot approach is proposed to extract key- value relation triplets in VRDs . |
| Approach: | They propose a few-shot relational learning approach targeting the extraction of key-value relation triplets in Visually-Rich Documents. |
| Outcome: | The proposed method outperforms existing methods in visually-rich documents. |
LogosKG: Hardware-Optimized Scalable and Interpretable Knowledge Graph Retrieval (2026.acl-long)
Copied to clipboard
He Cheng, Yifu Wu, Saksham Khatwani, Maya Kruse, Dmitriy Dligach, Timothy A. Miller, Majid Afshar, Yanjun Gao
| Challenge: | Existing systems struggle to balance efficiency, scalability, and interpretability. |
| Approach: | They propose a hardware-aligned framework that enables scalable and interpretable k-hop retrieval on large KGs. |
| Outcome: | The proposed framework scales to billion-edge graphs without loss of retrieval fidelity. |
On the Role of Discriminative Models in Generative Relation Extraction (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for relation extraction (RE) are discriminative and generative . previous studies show that discriminative models can support generative RE . |
| Approach: | They propose a framework that leverages discriminative models to produce a top-k set of candidate relations and integrates this knowledge into generative models via in-context or prompt learning. |
| Outcome: | The proposed framework achieves state-of-the-art on five widely used RE benchmarks. |